A Dual of the Rectangle-Segmentation Problem for Binary Matrices
نویسنده
چکیده
We consider the problem to decompose a binary matrix into a small number of binary matrices whose 1-entries form a rectangle. We show that the linear relaxation of this problem has an optimal integral solution corresponding to a well known geometric result on the decomposition of rectilinear polygons. MSC: 90C27, 90C46
منابع مشابه
Design of Persian Karbandi: The Problem of Dividing the Base from a Mathematical Viewpoint
Karbandi is the structure of a kind of roofing in Persian architecture. One of the main issues related to the design of karbandi is that, due to its geometrical structure, it is not possible to design any desired karbandi on a given base. Therefore, it is necessary for the designer to be able to discern the proper karbandi for a given base. The most critical stage in designing a karbandi is whe...
متن کاملTraining Set of Data Bin for Small Black Pixels Neighborhood Recognition of Each Boundary
We first describe how to “fuzzify” the estimated binary columns to create a [0,1]-valued column. Werefer to this [0,1] -valued column as the soft segmentation column of the noisy spectrogram column.Similarly to the collection of soft segmentation columns as the soft segmentation image, or simply asthe soft segmentation. The band-dependent posterior probability that the hard segmentation columnv...
متن کاملSolving Fully Fuzzy Dual Matrix System With Optimization Problem
In this paper, the fuzzy dual matrix system as AX + B = CX + D in which A, B, C, D, X are LR fuzzy matrices is studied. At first we solve 1-cut system in order to find the core of LR fuzzy solution; then to obtain the spreads of the LR fuzzy solution, we discuss in several cases. The spreads are obtained by using multiplication, quasi norm and minimization problem with a special objective funct...
متن کاملAlgorithm for finding the largest inscribed rectangle in polygon
In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...
متن کاملComparing 511 keV Attenuation Maps Obtained from Different Energy Mapping Methods for CT Based Attenuation Correction of PET Data
Introduction: The advent of dual-modality PET/CT scanners has revolutionized clinical oncology by improving lesion localization and facilitating treatment planning for radiotherapy. In addition, the use of CT images for CT-based attenuation correction (CTAC) decreases the overall scanning time and creates a noise-free attenuation map (6map). CTAC methods include scaling, s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 16 شماره
صفحات -
تاریخ انتشار 2009